A subquadratic algorithm for constructing approximately optimal binary search trees
نویسندگان
چکیده
منابع مشابه
Optimal Binary Search Trees
An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...
متن کاملOn Optimal Binary Search Trees
We present a new linear time heuristic for constructing binary search trees. The analysis of the algorithm, by establishing an upper bound on the cost of the produced binary search trees, permits to derive a limitation on the cost of optimal binary search trees. The obtained upper bound improve on previous results.
متن کاملA Genetic Algorithm for Constructing Compact Binary Decision Trees
Abstract Tree-based classifiers are important in pattern recognition and have been well studied. Although the problem of finding an optimal decision tree has received attention, it is a hard optimization problem. Here we propose utilizing a genetic algorithm to improve on the finding of compact, near-optimal decision trees. We present a method to encode and decode a decision tree to and from a ...
متن کاملThresholds and Optimal Binary Comparison Search Trees
We present an O(n4)-time algorithm for the following problem: Given a set of items with known access frequencies, find the optimal binary search tree under the realistic assumption that each comparison can only result in a two-way decision: either an equality comparison or a less-than comparisons. This improves the best known result of O(n5) time, which is based on split tree algorithms. Our al...
متن کاملOptimal Rebalancing of Binary Search Trees
We give, for any reasonable function f, a scheme for rebalancing a binary search tree with amortized O(f(n)) work per update while guaranteeing a height bounded by dlog(n+1)+1=f(n)e for all n. As a corollary, in the semi-dynamic case, height dlog(n+1)e can be guaranteed with amortized O(log n) work per insertion. Both results match existing lower bounds, and hence provide an exact characterizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1987
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90052-6